Extension of write anywhere file system layout

ABSTRACT

A file system layout apportions an underlying physical volume into one or more virtual volumes (vvols) of a storage system. The underlying physical volume is an aggregate comprising one or more groups of disks, such as RAID groups, of the storage system. The aggregate has its own physical volume block number (pvbn) space and maintains metadata, such as block allocation structures, within that pvbn space. Each vvol has its own virtual volume block number (vvbn) space and maintains metadata, such as block allocation structures, within that vvbn space. Notably, the block allocation structures of a vvol are sized to the vvol, and not to the underlying aggregate, to thereby allow operations that manage data served by the storage system (e.g., snapshot operations) to efficiently work over the vvols.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. Ser. No. 12,185,552, filed byJohn K. Edwards et al on Aug. 4, 2008, which is a continuation of U.S.Ser. No. 10/836,817, issued as U.S. Pat. No. 7,409,494 on Aug. 5, 2008,filed by John K. Edwards et al. on Apr. 30, 2004.

FIELD OF THE INVENTION

The present invention relates to file systems and, more specifically, toa file system layout that is optimized for low-latency read performanceand efficient data management operations.

BACKGROUND OF THE INVENTION

A storage system typically comprises one or more storage devices intowhich information may be entered, and from which information may beobtained, as desired. The storage system includes a storage operatingsystem that functionally organizes the system by, inter alia, invokingstorage operations in support of a storage service implemented by thesystem. The storage system may be implemented in accordance with avariety of storage architectures including, but not limited to, anetwork-attached storage environment, a storage area network and a diskassembly directly attached to a client or host computer. The storagedevices are typically disk drives organized as a disk array, wherein theterm “disk” commonly describes a self-contained rotating magnetic mediastorage device. The term disk in this context is synonymous with harddisk drive (HDD) or direct access storage device (DASD).

Storage of information on the disk array is preferably implemented asone or more storage “volumes” of physical disks, defining an overalllogical arrangement of disk space. The disks within a volume aretypically organized as one or more groups, wherein each group may beoperated as a Redundant Array of Independent (or Inexpensive) Disks(RAID). Most RAID implementations enhance the reliability/integrity ofdata storage through the redundant writing of data “stripes” across agiven number of physical disks in the RAID group, and the appropriatestoring of redundant information (parity) with respect to the stripeddata. The physical disks of each RAID group may include disks configuredto store striped data (i.e., data disks) and disks configured to storeparity for the data (i.e., parity disks). The parity may thereafter beretrieved to enable recovery of data lost when a disk fails. The term“RAID” and its various implementations are well-known and disclosed in ACase for Redundant Arrays of Inexpensive Disks (RAID), by D. A.Patterson, G. A. Gibson and R. H. Katz, Proceedings of the InternationalConference on Management of Data (SIGMOD), June 1988.

is The storage operating system of the storage system may implement ahigh-level module, such as a file system, to logically organize theinformation stored on the disks as a hierarchical structure ofdirectories, files and blocks. For example, each “on-disk” file may beimplemented as set of data structures, i.e., disk blocks, configured tostore information, such as the actual data for the file. These datablocks are organized within a volume block number (vbn) space that ismaintained by the file system. The file system organizes the data blockswithin the vbn space as a “logical volume”; each logical volume may be,although is not necessarily, associated with its own file system. Thefile system typically consists of a contiguous range of vbns from zeroto n, for a file system of size n−1 blocks.

A known type of file system is a write-anywhere file system that doesnot over-write data on disks. If a data block is retrieved (read) fromdisk into a memory of the storage system and “dirtied” (i.e., updated ormodified) with new data, the data block is thereafter stored (written)to a new location on disk to optimize write performance. Awrite-anywhere file system may initially assume an optimal layout suchthat the data is substantially contiguously arranged on disks. Theoptimal disk layout results in efficient access operations, particularlyfor sequential read operations, directed to the disks. An example of awrite-anywhere file system that is configured to operate on a storagesystem is the Write Anywhere File Layout (WAFL™) file system availablefrom Network Appliance, Inc., Sunnyvale, California.

The storage operating system may further implement a storage module,such as a RAID system, that manages the storage and retrieval of theinformation to and from the disks in accordance with input/output (I/O)operations. The RAID system is also responsible for parity operations inthe storage system. Note that the file system only “sees” the data diskswithin its vbn space; the parity disks are “hidden” from the file systemand, thus, are only visible to the RAID system. The RAID systemtypically organizes the RAID groups into one large “physical” disk(i.e., a physical volume), such that the disk blocks are concatenatedacross all disks of all RAID groups. The logical volume maintained bythe file system is then “disposed over” (spread over) the physicalvolume maintained by the RAID system.

The storage system may be configured to operate according to aclient/server model of information delivery to thereby allow manyclients to access the directories, files and blocks stored on thesystem. In this model, the client may comprise an application, such as adatabase application, executing on a computer that “connects” to thestorage system over a computer network, such as a point-to-point link,shared local area network, wide area network or virtual private networkimplemented over a public network, such as the Internet. Each client mayrequest the services of the file system by issuing file system protocolmessages (in the form of packets) to the storage system over thenetwork. By supporting a plurality of file system protocols, such as theconventional Common Internet File System (CIFS) and the Network FileSystem (NFS) protocols, the utility of the storage system is enhanced.

When accessing a block of a file in response to servicing a clientrequest, the file system specifies a vbn that is translated at the filesystem/RAID system boundary into a disk block number (dbn) location on aparticular disk (disk, dbn) within a RAID group of the physical volume.Each block in the vbn space and in the dbn space is typically fixed,e.g., 4 k bytes (kB), in size; accordingly, there is typically aone-to-one mapping between the information stored on the disks in thedbn space and the information organized by the file system in the vbnspace. The (disk, dbn) location specified by the RAID system is sfurther translated by a disk driver system of the storage operatingsystem into a plurality of sectors (e.g., a 4 kB block with a RAIDheader translates to 8 or 9 disk sectors of 512 or 520 bytes) on thespecified disk.

The requested block is then retrieved from disk and stored in a buffercache of the memory as part of a buffer tree of the file. The buffertree is an internal representation of blocks for a file stored in thebuffer cache and maintained by the file system. Broadly stated, thebuffer tree has an inode at the root (top-level) of the file. An inodeis a data structure used to store information, such as metadata, about afile, whereas the data blocks are structures used to store the actualdata for the file. The information contained in an inode may include,e.g., ownership of the file, access permission for the file, size of isthe file, file type and references to locations on disk of the datablocks for the file. The references to the locations of the file dataare provided by pointers, which may further reference indirect blocksthat, in turn, reference the data blocks, depending upon the quantity ofdata in the file. Each pointer may be embodied as a vbn to facilitateefficiency among the file system and the RAID system when accessing thedata on disks.

The RAID system maintains information about the geometry of theunderlying physical disks (e.g., the number of blocks in each disk) inraid labels stored on the disks. The RAID system provides the diskgeometry information to the file system for use when creating andmaintaining the vbn-to-disk,dbn mappings used to perform writeallocation operations and to translate vbns to disk locations for readoperations. Block allocation data structures, such as an active map, asnapmap, a space map and a summary map, are data structures thatdescribe block usage within the file system, such as the write-anywherefile system. These mapping data structures are independent of thegeometry and are used by a write allocator of the file system asexisting infrastructure for the logical volume.

Specifically, the snapmap denotes a file including a bitmap associatedwith the vacancy of blocks of a snapshot. The write-anywhere file system(such as the WAFL file system) has the capability to generate a snapshotof its active file system. An “active file system” is a file system towhich data can be both written and read or, more generally, an activestore that responds to both read and write I/O operations. It should benoted that “snapshot” is a trademark of Network Appliance, Inc. and isused for purposes of this patent to designate a persistent consistencypoint (CP) image. A persistent consistency point image (PCPI) is a spaceconservative, point-in-time read-only image of data accessible by namethat provides a consistent image of that data (such as a storage system)at some previous time. More particularly, a PCPI is a point-in-timerepresentation of a storage element, such as an active file system, fileor database, stored on a storage device (e.g., on disk) or otherpersistent memory and having a name or other identifier thatdistinguishes it from other PCPIs taken at other points in time. In thecase of the WAFL file system, a PCPI is always an active file systemimage that contains complete information is about the file system,including all metadata. A PCPI can also include other information(metadata) about the active file system at the particular point in timefor which the image is taken. The terms “PCPI” and “snapshot” may beused interchangeably through out this patent without derogation ofNetwork Appliance's trademark rights.

The write-anywhere file system supports multiple snapshots that aregenerally created on a regular schedule. Each snapshot refers to a copyof the file system that diverges from the active file system over timeas the active file system is modified. In the case of the WAFL filesystem, the active file system diverges from the snapshots since thesnapshots stay in place as the active file system is written to new disklocations. Each snapshot is a restorable version of the storage element(e.g., the active file system) created at a predetermined point in timeand, as noted, is “read-only” accessible and “space-conservative”. Spaceconservative denotes that common parts of the storage element inmultiple snapshots share the same file system blocks. Only thedifferences among these various snapshots require extra storage blocks.The multiple snapshots of a storage element are not independent copies,each consuming disk space; therefore, creation of a snapshot on the filesystem is instantaneous, since no entity data needs to be copied.Read-only accessibility denotes that a snapshot cannot be modifiedbecause it is closely coupled to a single writable image in the activefile system. The closely coupled association between a file in theactive file system and the same file in a snapshot obviates the use ofmultiple “same” files. In the example of a WAFL file system, snapshotsare described in TR3002 File System Design for a NFS File ServerAppliance by David Hitz et al., published by Network Appliance, Inc. andin U.S. Pat. No. 5,819,292 entitled Method for Maintaining ConsistentStates of a File System and For Creating User-Accessible Read-OnlyCopies of a File System, by David Hitz et al., each of which is herebyincorporated by reference as though full set forth herein.

The active map denotes a file including a bitmap associated with a freestatus of the active file system. As noted, a logical volume may beassociated with a file system; the term “active file system” refers to aconsistent state of a current file system. The summary map denotes afile including an inclusive logical OR bitmap of all snapmaps. Byexamining the active and summary maps, the file system can determinewhether a block is in use by either the active file system or anysnapshot. The space map denotes a file including an array of numbersthat describe the number of storage blocks used (counts of bits inranges) in a block allocation area. In other words, the space map isessentially a logical OR bitmap between the active and summary maps toprovide a condensed version of available “free block” areas within thevbn space. Examples of snap-shot and block allocation data structures,such as the active map, space map and summary map, are described in U.S.Patent Application Publication No. US2002/0083037 A1, titled InstantSnapshot, by Blake Lewis et al. and published on Jun. 27, 2002, whichapplication is hereby incorporated by reference.

The write-anywhere file system typically performs write allocation ofblocks in a logical volume in response to an event in the file system(e.g., dirtying of the blocks in a file). When write allocating, thefile system uses the block allocation data structures to select freeblocks within its vbn space to which to write the dirty blocks. Theselected blocks are generally in the same positions along the disks foreach RAID group (i.e., within a stripe) so as to optimize use of theparity disks. Stripes of positional blocks may vary among other RAIDgroups to, e.g., allow overlapping of parity update operations. Whenwrite allocating, the file system traverses a small portion of each disk(corresponding to a few blocks in depth within each disk) to essentially“lay down” a plurality of stripes per RAID group. In particular, thefile system chooses vbns that are on the same stripe per RAID groupduring write allocation using the vbn-to-disk,dbn mappings.

As disks increase in size, the logical volume may also increase,resulting in more storage space than a user (client) may need in asingle managed logical unit of storage. This presents the client with achoice of either combining multiple data sets onto the large disks ofthe logical volume and creating resulting management issues or placingdiscrete data sets on a small number of disks (thus creating a “small”logical volume) and accepting reduced performance. The small logicalvolume approach suffers reduced performance because, among other things,the use of few disks to store data results in high parity overhead.

A conventional solution to this problem is to “hard” partition the disksof the storage system, e.g., construct a RAID group from the disks,divide the RAID group into horizontal “slices” and dispose a logicalvolume (file system) on each slice. This solution provides a user withmany logical volumes over many disks and the flexibility to size thevolumes as needed. Yet, this solution is inflexible with respect tochanging the storage space (per file system) among the volumes once thedisks are hard partitioned. Hard partitioning denotes apportioning freestorage space among the logical volumes; often the available freestorage space is not in the intended volume and, as a result, it isdifficult and costly to move the free space (i.e., change suchpartitioning) where it is needed.

Another solution involves organizing a logical volume into smaller datamanagement entities called “qtrees”. A qtree is a special type ofdirectory that acts as a “soft” partition, i.e., the storage used by theqtrees is not limited by space boundaries. In this context, the qtreefunctions as a form of space virtualization that decouples physical disklimitations and underlying structure from a logical data managemententity. Files in a qtree are tagged as belonging to that qtree and, assuch, the files cannot be moved between qtrees. Yet qtrees share all ofthe disks of the logical volume and, thus, have access to all free spacewithin the volume. A qtree may have a quota, which is an“accounting-like” feature that limits the number of blocks that a qtreecan “own”. However, the limited blocks can be anywhere within thelogical volume. Data is written out to disks, arbitrarily, to free blocklocations of the qtrees. There is no hard partition, just a softaccounting-like partition.

Since qtrees are data management entities smaller than a logical volume,clients typically use qtrees extensively and build features based onthem. For example, a client may use a qtree to store a database.However, a disadvantage of a qtree is that it resides in a logicalvolume and certain features of the write-anywhere file layout system,particularly snapshot operation functionality, are logical volumeattributes. Thus, when a client creates a snapshot of a database in aqtree (via a snapcreate operation), it must create a snapshot of allqtrees in the volume. Similarly, if the client snap restores thedatabase in the qtree (via a snaprestore operation), it must snaprestore all qtrees in the volume. Although qtrees allow access to allfree space within a logical volume, that flexibility is reduced by theconstraint to volume-level granularity features, such as snapcreate andsnaprestore operations.

Yet another solution to the increasing disk size problem is a naïve“nested volumes” approach that involves building logical volumes withinfiles of an underlying logical volume. This approach tends to introducean extra layer of indirection in a read latency path of the storagesystem. Also, a typical implementation of this solution would not allowfree space to be returned to the underlying logical volume; as a result,this solution suffers from the same management issues as a hardpartitioning solution.

Therefore, it is desirable to provide a write-anywhere file layoutsystem that merges properties of logical volumes and qtrees.

It is also desirable to provide a write-anywhere file layout system thatmerges a rich feature set of logical volumes with the spacevirtualization of qtrees.

SUMMARY OF THE INVENTION

The present invention overcomes the disadvantages of the prior art byproviding a novel file system layout that apportions an underlyingphysical volume into one or more virtual volumes (vvols) of a storagesystem. The underlying physical volume is an aggregate comprising one ormore groups of disks, such as RAID groups, of the storage system. Theaggregate has its own physical volume block number (pvbn) space andmaintains metadata, such as block allocation structures, within thatpvbn space. Each vvol has its own virtual volume block number (vvbn)space and maintains metadata, such as block allocation structures,within that vvbn space. Notably, the block allocation structures of avvol are sized to the vvol, and not to the underlying aggregate, tothereby allow operations that manage data served by the storage system(e.g., snapshot operations) to efficiently work over the vvols. Thenovel file system layout extends the file system layout of aconventional write anywhere file layout system implementation, yetmaintains performance properties of the conventional implementation.

Specifically, the extended file system layout facilitates efficient readperformance on read paths of files contained in a vvol by utilizingpvbns as block pointers within buffer trees of the files. The use ofpvbns avoids latency associated with translations from vvbns-to-pvbns,e.g., when servicing file system (such as NFS, CIFS) requests. Inaddition, less “work” is needed at the vvol level when performing datamanagement operations because of the use of relatively small blockallocation structures (sized to the vvbn space of the vvol) rather thanthe relatively large block allocation structures used at the aggregatelevel.

In accordance with an aspect of the present invention, each vvol is afile system that may be associated with a novel container file. Eachvvol has its own logical properties, such as snapshot operationfunctionality, while utilizing existing algorithms of the conventionalfile system layout implementation; an exception involves a free block inthe container file that is returned to the aggregate. In particular,free space is not partitioned among the multiple vvols of the aggregate;the free storage space is owned by the aggregate. This aspect of thepresent invention is notable because free space is a key determinant ofwrite allocation efficiency. Since free space is not held by a vvol andthe size of the vvol is the number of blocks it can use, not the size ofthe container file, the present invention also allows for flexiblesizing, including “over-committing” and “sparse provisioning”.

Another aspect of the present invention involves linking of a vvbn spacefor each vvol to an overall, underlying pvbn space of the aggregate.Here, the vvbn space of a vvol is used for efficient data managementoperations at the vvol granularity, while the pvbn space is used forread data path performance of buffer trees for files of the vvols. Thislatter aspect of the invention utilizes a container map per vvol and anowner map of the aggregate. The container map provides a “forwardmapping” of vvbns of a vvol to pvbns of the aggregate, whereas the ownermap provides a “backward mapping” between the pvbns and vvbns.

Advantageously, the extended file system layout assembles a group ofdisks into an aggregate having a large, underlying storage space andflexibly allocates that space among the vvols. To that extent, the vvolshave behaviors that are similar to those of qtrees, including access toall free block space within the aggregate without space boundarylimitations. Sizing of a vvol is flexible, avoiding partitioning ofstorage space and any resulting problems. The present invention providessubstantial performance advantages of a naïve nested volumesimplementation, particularly as optimized for low-latency readperformance.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and further advantages of the invention may be betterunderstood by referring to the following description in conjunction withthe accompanying drawings in which like reference numerals indicateidentical or functionally similar elements:

FIG. 1 is a schematic block diagram of an environment including astorage system that may be advantageously used with the presentinvention;

FIG. 2 is a schematic block diagram of a storage operating system thatmay be advantageously used with the present invention;

FIG. 3 is a schematic block diagram of an inode that may beadvantageously used with the present invention;

FIG. 4 is a schematic block diagram of a buffer tree of a file that maybe advantageously used with the present invention;

FIG. 5 is a schematic block diagram of a partial buffer tree of a largefile inside the file of FIG. 4;

FIG. 6 is a schematic block diagram of an embodiment of an aggregate inaccordance with the present invention;

FIG. 7 is a schematic block diagram of a container file of the presentinvention;

FIG. 8 is a schematic block diagram of an owner map of the presentinvention; and

FIG. 9 is a schematic block diagram of an on-disk representation of anaggregate in accordance with the present invention.

DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT

FIG. 1 is a schematic block diagram of an environment 100 including astorage is system 120 that may be advantageously used with the presentinvention. The storage system is a computer that provides storageservice relating to the organization of information on storage devices,such as disks 130 of a disk array 160. The storage system 120 comprisesa processor 122, a memory 124, a network adapter 126 and a storageadapter 128 interconnected by a system bus 125. The storage system 120also includes a storage operating system 200 that preferably implementsa high-level module, such as a file system, to logically organize theinformation as a hierarchical structure of directories, files andspecial types of files called virtual disks (hereinafter “blocks”) onthe disks.

In the illustrative embodiment, the memory 124 comprises storagelocations that are addressable by the processor and adapters for storingsoftware program code. A portion of the memory may be further organizedas a “buffer cache” 170 for storing certain data structures associatedwith the present invention. The processor and adapters may, in turn,comprise processing elements and/or logic circuitry configured toexecute the software code and manipulate the data structures. Storageoperating system 200, portions of which are typically resident in memoryand executed by the processing elements, functionally organizes thesystem 120 by, inter alia, invoking storage operations executed by thestorage system. It will be apparent to those skilled in the art thatother processing and memory means, including various computer readablemedia, may be used for storing and executing program instructionspertaining to the inventive technique described herein.

The network adapter 126 comprises the mechanical, electrical andsignaling circuitry needed to connect the storage system 120 to a client110 over a computer network 140, which may comprise a point-to-pointconnection or a shared medium, such as a local area network.Illustratively, the computer network 140 may be embodied as an Ethernetnetwork or a Fibre Channel (FC) network. The client 110 may communicatewith the storage system over network 140 by exchanging discrete framesor packets of data according to pre-defined protocols, such as theTransmission Control Protocol/Internet Protocol (TCP/IP).

The client 110 may be a general-purpose computer configured to executeapplications 112. Moreover, the client 110 may interact with the storagesystem 120 in accordance with a client/server model of informationdelivery. That is, the client may request the services of the storagesystem, and the system may return the results of the services requestedby the client, by exchanging packets 150 over the network 140. Theclients may issue packets including file-based access protocols, such asthe Common Internet File System (CIFS) protocol or Network File System(NFS) protocol, over TCP/IP when accessing information in the form offiles and directories. Alternatively, the client may issue packetsincluding block-based access protocols, such as the Small ComputerSystems Interface (SCSI) protocol encapsulated over TCP (iSCSI) and SCSIencapsulated over Fibre Channel (FCP), when accessing information in theform of blocks.

The storage adapter 128 cooperates with the storage operating system 200executing on the system 120 to access information requested by a user(or client). The information may be stored on any type of attached arrayof writable storage device media such as video tape, optical, DVD,magnetic tape, bubble memory, electronic random access memory,micro-electro mechanical and any other similar media adapted to storeinformation, including data and parity information. However, asillustratively described herein, the information is preferably stored onthe disks 130, such as HDD and/or DASD, of array 160. The storageadapter includes input/output (I/O) interface circuitry that couples tothe disks over an I/O interconnect arrangement, such as a conventionalhigh-performance, FC serial link topology.

Storage of information on array 160 is preferably implemented as one ormore storage “volumes” that comprise a collection of physical storagedisks 130 cooperating to define an overall logical arrangement of volumeblock number (vbn) space on the volume(s). Each logical volume isgenerally, although not necessarily, associated with its own filesystem. The disks within a logical volume/file system are typicallyorganized as one or more groups, wherein each group may be operated as aRedundant Array of Independent (or Inexpensive) Disks (RAID). Most RAIDimplementations, such as a RAID-4 level implementation, enhance thereliability/integrity of data storage through the redundant writing ofdata “stripes” across a given number of physical disks in the RAIDgroup, and the appropriate storing of parity information with respect tothe striped data. An illustrative example of a RAID implementation is aRAID-4 level implementation, although it should be understood that othertypes and levels of RAID implementations may be used in accordance withthe inventive principles described herein.

To facilitate access to the disks 130, the storage operating system 200implements a write-anywhere file system that cooperates withvirtualization modules to “virtualize” the storage space provided bydisks 130. The file system logically organizes the information as ahierarchical structure of named directories and files on the disks. Each“on-disk” file may be implemented as set of disk blocks configured tostore information, such as data, whereas the directory may beimplemented as a specially formatted file in which names and links toother files and directories are stored. The virtualization modules allowthe file system to further logically organize information as ahierarchical structure of blocks on the disks that are exported as namedlogical unit numbers (luns).

In the illustrative embodiment, the storage operating system ispreferably the NetApp® Data ONTAP™ operating system available fromNetwork Appliance, Inc., Sunnyvale, Calif. that implements a WriteAnywhere File Layout (WAFL™) file system. However, it is expresslycontemplated that any appropriate storage operating system may beenhanced for use in accordance with the inventive principles describedherein. As such, where the term “WAFL” is employed, it should be takenbroadly to refer to any storage operating system that is otherwiseadaptable to the teachings of this invention.

FIG. 2 is a schematic block diagram of the storage operating system 200that may be advantageously used with the present invention. The storageoperating system comprises a series of software layers organized to forman integrated network protocol stack or, more generally, amulti-protocol engine that provides data paths for clients to accessinformation stored on the storage system using block and file accessprotocols. The protocol stack includes a media access layer 210 ofnetwork drivers (e.g., gigabit Ethernet drivers) that interfaces tonetwork protocol layers, such as the IP layer 212 and its supportingtransport mechanisms, the TCP layer 214 and the User Datagram Protocol(UDP) layer 216. A file system protocol layer provides multi-protocolfile access and, to that end, includes support for the Direct AccessFile System (DAFS) protocol 218, the NFS protocol 220, the CIFS protocol222 and the Hypertext Transfer Protocol (HTTP) protocol 224. A VI layer226 implements the VI architecture to provide direct access transport(DAT) capabilities, such as RDMA, as required by the DAFS protocol 218.

An iSCSI driver layer 228 provides block protocol access over the TCP/IPnetwork protocol layers, while a FC driver layer 230 receives andtransmits block access requests and responses to and from the storagesystem. The FC and iSCSI drivers provide FC-specific and iSCSI-specificaccess control to the blocks and, thus, manage exports of luns to eitheriSCSI or FCP or, alternatively, to both iSCSI and FCP when accessing theblocks on the storage system. In addition, the storage operating systemincludes a storage module embodied as a RAID system 240 that manages thestorage and retrieval of information to and from the volumes/disks inaccordance with I/O operations, and a disk driver system 250 thatimplements a disk access protocol such as, e.g., the SCSI protocol.

Bridging the disk software layers with the integrated network protocolstack layers is a virtualization system that is implemented by a filesystem 280 interacting with virtualization modules illustrativelyembodied as, e.g., vdisk module 290 and SCSI target module 270. Thevdisk module 290 is layered on the file system 280 to enable access byadministrative interfaces, such as a user interface (UI) 275, inresponse to a user (system administrator) issuing commands to thestorage system. The SCSI target module 270 is disposed between the FCand iSCSI drivers 228, 230 and the file system 280 to provide atranslation layer of the virtualization system between the block (lun)space and the file system space, where luns are represented as blocks.The UI 275 is disposed over the storage operating system in a mannerthat enables administrative or user access to the various layers andsystems.

The file system is illustratively a message-based system that provideslogical volume management capabilities for use in access to theinformation stored on the storage devices, such as disks. That is, inaddition to providing file system semantics, the file system 280provides functions normally associated with a volume manager. Thesefunctions include (i) aggregation of the disks, (ii) aggregation ofstorage bandwidth of the disks, and (iii) reliability guarantees, suchas minoring and/or parity (RAID). The file system 280 illustrativelyimplements the WAFL file system (hereinafter generally the“write-anywhere file system”) having an on-disk format representationthat is block-based using, e.g., 4 kilobyte (kB) blocks and using indexnodes (“inodes”) to identify files and file attributes (such as creationtime, access permissions, size and block location). The file system usesfiles to store metadata describing the layout of its file system; thesemetadata files include, among others, an inode file. A file handle,i.e., an identifier that includes an inode number, is used to retrievean inode from disk.

Broadly stated, all inodes of the write-anywhere file system areorganized into the inode file. A file system (FS) info block specifiesthe layout of information in the file system and includes an inode of afile that includes all other inodes of the file system. Each logicalvolume (file system) has an FS info block that is preferably stored at afixed location within, e.g., a RAID group. The inode of the root FS infoblock may directly reference (point to) blocks of the inode file or mayreference indirect blocks of the inode file that, in turn, referencedirect blocks of the inode file. Within each direct block of the inodefile are embedded inodes, each of which may reference indirect blocksthat, in turn, reference data blocks of a file.

Operationally, a request from the client 110 is forwarded as a packet150 over the computer network 140 and onto the storage system 120 whereit is received at the network adapter 126. A network driver (of layer210 or layer 230) processes the packet and, if appropriate, passes it onto a network protocol and file access layer for additional processingprior to forwarding to the write-anywhere file system 280. Here, thefile system generates operations to load (retrieve) the requested datafrom disk 130 if it is not resident “in core”, i.e., in the buffer cache170. If the information is not in the cache, the file system 280 indexesinto the inode file using the inode number to access an appropriateentry and retrieve a logical vbn. The file system then passes a messagestructure including the logical vbn to the RAID system 240; the logicalvbn is mapped to a disk identifier and disk block number (disk,dbn) andsent to an appropriate driver (e.g., SCSI) of the disk driver system250. The disk driver accesses the dbn from the specified disk 130 and isloads the requested data block(s) in buffer cache 170 for processing bythe storage system. Upon completion of the request, the storage system(and operating system) returns a reply to the client 110 over thenetwork 140.

It should be noted that the software “path” through the storageoperating system layers described above needed to perform data storageaccess for the client request received at the storage system mayalternatively be implemented in hardware. That is, in an alternateembodiment of the invention, a storage access request data path may beimplemented as logic circuitry embodied within a field programmable gatearray (FPGA) or an application specific integrated circuit (ASIC). Thistype of hardware implementation increases the performance of the storageservice provided by storage system 120 in response to a request issuedby client 110. Moreover, in another alternate embodiment of theinvention, the processing elements of adapters 126, 128 may beconfigured to offload some or all of the packet processing and storageaccess operations, respectively, from processor 122, to thereby increasethe performance of the storage service provided by the system. It isexpressly contemplated that the various processes, architectures andprocedures described herein can be implemented in hardware, firmware orsoftware.

As used herein, the term “storage operating system” generally refers tothe computer-executable code operable to perform a storage function in astorage system, e.g., that manages data access and may, in the case of afile server, implement file system semantics. In this sense, the ONTAPsoftware is an example of such a storage operating system implemented asa microkernel and including the WAFL layer to implement the WAFL filesystem semantics and manage data access. The storage operating systemcan also be implemented as an application program operating over ageneral-purpose operating system, such as UNIX® or Windows NT®, or as ageneral-purpose operating system with configurable functionality, whichis configured for storage applications as described herein.

In addition, it will be understood to those skilled in the art that theinventive technique described herein may apply to any type ofspecial-purpose (e.g., file server, filer or multi-protocol storageappliance) or general-purpose computer, including a standalone computeror portion thereof, embodied as or including a storage system 120. Anexample of a multi-protocol storage appliance that may be advantageouslyused with the present invention is described in U.S. patent applicationSer. No. 10/215,917 titled, Multi-Protocol Storage Appliance thatprovides Integrated Support for File and Block Access Protocols, filedon Aug. 8, 2002. Moreover, the teachings of this invention can beadapted to a variety of storage system architectures including, but notlimited to, a network-attached storage environment, a storage areanetwork and disk assembly directly-attached to a client or hostcomputer. The term “storage system” should therefore be taken broadly toinclude such arrangements in addition to any subsystems configured toperform a storage function and associated with other equipment orsystems.

In the illustrative embodiment, a file is represented in thewrite-anywhere file system as an inode data structure adapted forstorage on the disks 130. FIG. 3 is a schematic block diagram of aninode 300, which preferably includes a metadata section 310 and a datasection 350. The information stored in the metadata section 310 of eachinode 300 describes the file and, as such, includes the type (e.g.,regular, directory, virtual disk) 312 of file, the size 314 of the file,time stamps (e.g., access and/or modification) 316 for the file andownership, i.e., user identifier (UID 318) and group ID (GID 320), ofthe file. The contents of the data section 350 of each inode, however,may be interpreted differently depending upon the type of file (inode)defined within the type field 312. For example, the data section 350 ofa directory inode contains metadata controlled by the file system,whereas the data section of a regular inode contains file system data.In this latter case, the data section 350 includes a representation ofthe data associated with the file.

Specifically, the data section 350 of a regular on-disk inode mayinclude file system data or pointers, the latter referencing 4 kB datablocks on disk used to store the file system data. Each pointer ispreferably a logical vbn to facilitate efficiency among the file systemand the RAID system 240 when accessing the data on disks. Given therestricted size (e.g., 128 bytes) of the inode, file system data havinga size that is less than or equal to 64 bytes is represented, in itsentirety, within the data section of that inode. However, if the filesystem data is greater than 64 bytes but less than or equal to 64 kB,then the data section of the inode (e.g., a first level inode) comprisesup to 16 pointers, each of which references a 4 kB block of data on thedisk.

Moreover, if the size of the data is greater than 64 kB but less than orequal to 64 megabytes (MB), then each pointer in the data section 350 ofthe inode (e.g., a second level inode) references an indirect block(e.g., a first level block) that contains 1024 pointers, each of whichreferences a 4 kB data block on disk. For file system data having a sizegreater than 64MB, each pointer in the data section 350 of the inode(e.g., a third level inode) references a double-indirect block (e.g., asecond level block) that contains 1024 pointers, each referencing anindirect (e.g., a first level) block. The indirect block, in turn, thatcontains 1024 pointers, each of which references a 4 kB data block ondisk. When accessing a file, each block of the file may be loaded fromdisk 130 into the buffer cache 170.

When an on-disk inode (or block) is loaded from disk 130 into buffercache 170, its corresponding in core structure embeds the on-diskstructure. For example, the dotted line surrounding the inode 300 (FIG.3) indicates the in core representation of the on-disk inode structure.The in core structure is a block of memory that stores the on-diskstructure plus additional information needed to manage data in thememory (but not on disk). The additional information may include, e.g.,a “dirty” bit 360. After data in the inode (or block) isupdated/modified as instructed by, e.g., a write operation, the modifieddata is marked “dirty” using the dirty bit 360 so that the inode (block)can be subsequently “flushed” (stored) to disk. The in core and on-diskformat structures of the WAFL file system, including the inodes andinode file, are disclosed and described in the previously incorporatedU.S. Pat. No. 5,819,292 titled Method for Maintaining Consistent Statesof a File System and for Creating User-Accessible Read-Only Copies of aFile System by David Hitz et al., issued on Oct. 6, 1998.

FIG. 4 is a schematic block diagram of a buffer tree of a file that maybe advantageously used with the present invention. The buffer tree is aninternal representation of blocks for a file (e.g., file A 400) loadedinto the buffer cache 170 and maintained by the write-anywhere filesystem 280. A root (top-level) inode 402, such as an embedded inode,references indirect (e.g., level 1) blocks 404. The indirect blocks (andinode) contain pointers 405 that ultimately reference data blocks 406used to store the actual data of file A. That is, the data of file A 400are contained in data blocks and the locations of these blocks arestored in the indirect blocks of the file. Each level 1 indirect block404 may contain pointers to as many as 1024 data blocks. According tothe “write anywhere” nature of the file system, these blocks may belocated anywhere on the disks 130.

As noted, the size of a logical volume generally increases as disksincrease in size, resulting in more storage space than a client may needin a single managed logical unit of storage. A solution to thisincreasing disk size problem is a naïve “nested volumes” approach thatinvolves building logical volumes within files of an underlying logicalvolume, i.e., a “pure” logical (file system) volume stored in a file.FIG. 5 is a schematic block diagram of a partial buffer tree of a largefile (e.g., file B 500) that resides inside a file (e.g., file A 400)containing a logical volume. All indirect blocks in the file B utilizevbns as block pointers. For example, block pointer vbn 23 in inode 502indicates that “child” indirect block 504 is at vbn 23 and block pointervbn 19 in indirect block 504 indicates that level 0 block 506 is at vbn19. However, because file B 500 is inside another file (file A 400)containing a logical volume, vbn 23 is not a location on disk but ratheris a location in file A 400. Therefore, the write-anywhere file systemsearches for vbn 23 in file A 400 in order to access the correctindirect block.

Assume that the file system 280 attempts to read level 0 block 506 fromfile B 500. The file system traverses the buffer tree of file B andlocates the level 0 block 506. For a logical volume inside of a file,the location of a level 0 block is a location within the file. That is,the location of level 0 block 506 of file B 500 is a location within thefile A 400. Therefore, to find the actual data in the level 0 block 506in the buffer tree of file B, the file system must traverse the buffertree of file A. This results in having to traverse two buffer trees offiles in order to access the correct blocks, which causes inefficientoverhead (latency) for read operations. In particular, this approachintroduces an extra layer of indirection in a read latency path of thestorage system.

However, an advantage of this “pure” logical volume approach includesthe ability to exploit various file system features for a logical volumeinside of a file containing a logical volume. For instance, the filesystem accesses block allocation (bitmap) structures, such as active andsummary maps, when creating a snapshot of a logical volume. The bit mapsare sized to the size of the logical volume; thus a large volumerequires large bit maps, which results in large overhead when performingsnapshot operations, such as snapdelete (to remove a snapshot) orsnapcreate. For a logical volume inside a file containing a logicalvolume, the file may be “small” and the vbn space (hereinafter a“virtual” vbn space) of the file (hereinafter a “virtual” volume) issized to the file. Therefore, the virtual vbn (vvbn) space is muchsmaller and the cost of taking a snapshot of the virtual volume (vvol)is much smaller. The present invention is directed to a variant of this“nesting” approach.

The pure logical volume in a file approach creates a “hidden” filewithin a physical volume, wherein the hidden file contains the logicalvolume. As noted, the RAID system 240 organizes the RAID groups of thedisks as a physical volume. When the file system retrieves a vbn (e.g.,vbn X), it uses disk geometry information provided by the RAID system totranslate that vbn into a disk,dbn location on disk. When operating in avvol, a vvbn identifies a file block number (fbn) location within thefile and the file system uses the indirect blocks of the hidden(container) file to translate the fbn into a physical vbn (pvbn)location within the physical volume, which block can then be retrievedfrom disk using the geometry supplied by the RAID system. The logicalvolume contained within the hidden file holds all conventional filesystem metadata files for the volume. Block allocation bitmaps of thevvol indicate whether the block location in the hidden file is in use bythe contained logical volume. Indirect blocks of files within the vvol,including those embedded in inode file blocks, contain vvbns. Asdescribed further herein, the indirect blocks of the hidden (container)file effectively amount to an indirection layer, translatingvvbns-to-pvbns in the aggregate.

The present invention is directed to a novel file system layout thatapportions an underlying physical volume into one or more vvols of astorage system. The underlying physical volume is an aggregatecomprising one or more groups of disks, such as RAID groups, of thestorage system. The aggregate has its own pvbn space and maintainsmetadata, such as block allocation structures, within that pvbn space.Each vvol also has its own vvbn space and maintains metadata, such asblock allocation structures, within that vvbn space. Notably, the blockallocation structures of a vvol are sized to the vvol, and not to theunderlying aggregate, to thereby allow operations that manage dataserved by the storage system (e.g. snapshot operations) to efficientlywork over the vvols. The novel file system layout extends the filesystem layout of a conventional write anywhere file layout (e.g., WAFL)system implementation, yet maintains performance properties of theconventional implementation.

FIG. 6 is a schematic block diagram of an embodiment of an aggregate 600in accordance with the present invention. Luns (blocks) 602, directories604, qtrees 606 and files 608 may be contained within vvols 610 that, inturn, are contained within the aggregate 600. The aggregate 600 isillustratively layered on top of the RAID system, which is representedby at least one RAID plex 650 (depending upon whether the storageconfiguration is mirrored), wherein each plex 650 comprises at least oneRAID group 660. Each RAID group further comprises a plurality of disks630, e.g., one or more data (D) disks and at least one (P) parity disk.

Whereas the aggregate 600 is analogous to a physical volume of aconventional storage system, a vvol is analogous to a file within thatphysical volume. That is, the aggregate 600 may include one or morefiles, wherein each file contains a vvol 610 and wherein the sum of thestorage space consumed by the vvols is physically smaller than (or equalto) the size of the overall physical volume, i.e., the vvol must usefewer blocks than the aggregate has, but need not have a smaller vbnspace. The aggregate utilizes a “physical” pvbn space that defines astorage space of blocks provided by the disks of the physical volume,while each embedded vvol (within a file) utilizes a “logical” vvbn spaceto organize those blocks, e.g., as files. Each vvbn space is anindependent set of numbers that corresponds to locations within thefile, which locations are then translated to dbns on disks. Since thevvol 610 is also a logical volume, it has its own block allocationstructures (e.g., active, space and summary maps) in its vvbn space.

A snapshot can thus be created on a vvol granularity using the vvol'sblock allocation bitmaps, which are sized to the vvbn space. Creating asnapshot denotes that certain blocks cannot be overwritten; i.e., blocklocations in the container file cannot be overwritten. Those snapshottedblocks are thus “frozen” and the bitmaps within the vvol that governoverwriting of block locations freeze (“hold down”) those locations inthe file (i.e., freeze locations in vvbn space that the vvol cannotreuse). This also freezes the physical blocks or pvbns that correspondto those, and only those, vvbns. Substantially all functions/featuresthat can be performed on a logical volume, including any snapshotoperation, can also be performed on the vvol. Notably, since the vvbnspace may be much smaller than the pvbn space, the cost of a snapshotoperation is advantageously sized to the vvol granularity.

Each vvol 610 may be a separate file system that is “mingled” onto acommon set of storage in the aggregate 600 by the storage operatingsystem 200. The RAID system 240 builds a raid topology structure for theaggregate that guides each file system when performing write allocation.The RAID system also presents a pvbn-to-disk,dbn mapping to the filesystem. A vvol 610 only uses the storage space of the aggregate 600 whenit has data to store; accordingly, the size of a vvol can beovercommitted. Space reservation policies ensure that the entire storagespace of a vvol is available to a client of the vvol when overcommitmentis not desired. The overcommitted aspect is a feature of the aggregatethat results in improved storage efficiency.

According to an aspect of the extended file system layout, pvbns areused as block pointers within buffer trees of files stored in a vvol. Byutilizing pbvns (instead of vvbns) as block pointers within buffer treesof the files (such as file B 500), the extended file system layoutfacilitates efficient read performance on read paths of those files.That is, the use of pvbns avoids latency associated with translationsfrom vvbns-to-pvbns, e.g., when servicing file system (such as NFS,CIFS) requests. On a read path of a logical volume, a volume (vol) infoblock has a pointer that references an fsinfo block that, in turn,“points to” an Mode file and its corresponding buffer tree. The readpath on a vvol is generally the same, following pvbns (instead of vvbns)to find appropriate locations of blocks; in this context, the read path(and corresponding read performance) of a vvol is substantially similarto that of a physical volume. Translation from pvbn-to-disk,dbn occursat the file system/RAID system boundary of the storage operating system200.

A container file is a file in the aggregate that contains all blocksused by a vvol. The container file is an internal (to the aggregate)feature that supports a vvol; illustratively, there is one containerfile per vvol. Similar to the pure logical volume in a file approach,the container file is a hidden file (not accessible to a user) in theaggregate that holds every block in use by the vvol. According toanother aspect of the invention, the aggregate includes an illustrativehidden metadata root directory that contains subdirectories of vvols:

WAFL/fsid/filesystem file, storage label file

Specifically, a “physical” file system (WAFL) directory includes asubdirectory for each vvol in the aggregate, with the name ofsubdirectory being a file system identifier (fsid) of the vvol. Eachfsid subdirectory (vvol) contains at least two files, a filesystem fileand a storage label file. The storage label file is illustratively a 4kB file that contains metadata similar to that stored in a conventionalraid label. In other words, the storage label file is the analog of araid label and, as such, contains information about the state of thevvol such as, e.g., the name of the vvol, a universal unique identifier(uuid) and fsid of the vvol, whether it is online, being created orbeing destroyed, etc.

The filesystem file is a large sparse file that contains all blocksowned by a vvol and, as such, is referred to as the container file forthe vvol. FIG. 7 is a schematic block diagram of a container file 700(buffer tree) in accordance with the present invention. The containerfile 700 is assigned a new type and has an inode 702 that is assigned aninode number equal to a virtual volume id (vvid) of the vvol, e.g.,container file 700 has an inode number 113. The container file isessentially one large, sparse virtual disk and, since it contains allblocks owned by its vvol, a block with vvbn X in the vvol can be foundat fbn X in the container file. For example, vvbn 2000 in a vvol can befound at fbn 2000 in its container file 700. Since each vvol has its owndistinct vvbn space, another container file has fbn 2000 that isdifferent from fbn 2000 in the illustrative container file 700.

Assume that a level 0 block 706 of the container file 700 has an fbn2000 and a “parent” indirect (level 1) block 704 of the level 0 block706 has a block pointer referencing the level 0 block, wherein the blockpointer has a pvbn 20. Thus, location fbn 2000 of the container file 700is pvbn 20 (on disk). Notably, the block numbers are maintained at thefirst indirect level (level 1) of the container file 700; e.g., tolocate block 2000 in the container file, the file system layer accessesthe 2000^(th) entry at level 1 of the container file and that indirectblock provides the pvbn 20 for fbn 2000.

In other words, level 1 indirect blocks of the container file containthe pvbns for blocks in the file and, thus, “map” vvbns-to-pvbns of theaggregate. According to another aspect of the invention, the level 1indirect blocks of the container file 700 are configured as a “containermap” 750 for the vvol; there is preferably one container map 750 pervvol. Specifically, the container map provides block pointers from fbnlocations within the container file to pvbn locations on disk.Furthermore, there is a one-to-one correspondence between fbn locationsin the container file and vvbn locations in a vvol; this allowsapplications that need to access the vvol to find blocks on disk via thevvbn space.

As noted, each vvol has its own vvbn space that contains its own versionof all file system metadata files, including block allocation (bitmap)structures that are sized to that space. Less work is thus needed at thevvol level when performing data management operations because of the useof relatively small block allocation structures (sized to the vvbn spaceof the vvol) rather than the relatively large block allocationstructures used at the aggregate level. As also noted, the indirectblocks of files within a vvol contain pvbns in the underlying aggregaterather than vvbns, as described in the illustrative embodiment. Thisremoves the indirection from the read path, resulting in some complexityin image transfers and write allocation, but improving the performanceof the read path.

For example, when updating/modifying data (i.e., “dirtying”) of an “old”block in a file during write allocation, the file system selects a newblock and frees the old block, which involves clearing bits of the blockallocation bitmaps for the old block in the logical volume's vbn (nowpvbn) space. In essence, the file system 280 only knows that aparticular physical block (pvbn) has been dirtied. However, freeingblocks within the vvol requires use of a vvbn to clear the appropriatebits in the vvbn-oriented block allocation files. Therefore, in theabsence of a vvbn, a “backward” mapping (pvbn-to-vvbn) mechanism isneeded at the aggregate level.

In accordance with another aspect of the invention, novel mappingmetadata provides a backward mapping between each pvbn in the aggregateto (i) a vvid that “owns” the pvbn and (ii) the vvbn of the vvol inwhich the pvbn is located. The backward mapping metadata is preferablysized to the pvbn space of the aggregate; this does not present ascalability concern, since the mapping metadata for each of vvol can beinterleaved into a single file, referred to as an owner map, in theaggregate. FIG. 8 is a schematic block diagram of an owner map 800 inaccordance with the present invention. The owner map 800 may be embodiedas a data structure having a plurality of entries 810; there ispreferably one entry 810 for each block in the aggregate.

In the illustrative embodiment, each entry 810 has a 4-byte vvol id(vvid) and a 4-byte vvbn, and is indexed by a pvbn. That is, for a givenblock in the aggregate, the owner entry 810 indicates which vvol ownsthe block and which pvbn it maps to in the vvbn space, e.g., owner entry810 indexed at pvbn 20 has contents vvid 113 and vvbn 2000. Thus whenindexing into the owner map 800 at pvbn 20, the file system 280 accessesa vvol having an inode 113 (which is container file 700) and thenaccesses block location 2000 within that file. Each entry 810 of theowner map 800 is only valid for blocks that are in use; therefore,updates to the owner map are optimized to occur at a write allocationpoint. In general, a vvol only owns those blocks used in the containedfile system. There may be situations where the vvol owns blocks thecontained file system is not using. Allocated blocks that are not ownedby any vvol illustratively have owner map entries (0, 0).

is According to the extended file system layout, the owner map 800provides a backward mapping between pvbn-to-vvbn (and vvid), while thecontainer map 750 provides a “forward” mapping of vvbn-to-pvbn. Withinthe context of the present invention, it is always true that if vvbn Xin the container map 750 for vvol V is pvbn Y, then entry Y in the ownermap 800 is (V, X). Similarly if block Y is allocated in the aggregateand the owner map entry is (V, X), then entry X in the container map 750for V has a value Y. The fact that the vvid is the inode number of thecontainer file 700 and that the container file is a special typefacilitates consistency checking between the owner map and the containerfile.

Illustratively, there is one owner map 800 per aggregate 600, whereinthe owner map 800 may be configured to provided a simple mapping of(pvbn-to-vvbn) or a more elaborate (pvbn-to-vvol,vvbn). In the formercase, the size of the owner map amounts to approximately 0.1% of thefile system (i.e., size of a conventional block map), whereas in thelatter case, the owner map size is twice that amount. However, theadditional information contained in the latter case is useful in variousapplications such as, e.g., file system checking and cloning operations.A pvbn is owned by only one vvol and, in some situations, is not ownedby any vvol (and thus owned by the aggregate). Entries 810 of the ownermap 800 are only maintained for pvbn blocks that are allocated in theaggregate 600. Thus, for each entry 810 in the owner map 800, the filesystem 280 can locate the container file 700 defined by the vvid andlocate the fbn of the file (corresponding to the vvbn of the entry) andthe resulting block is the pvbn (on disk).

FIG. 9 is a schematic block diagram of an on-disk representation of anaggregate 900 in accordance with the present invention. The storageoperating system 200, e.g., the RAID system 240, assembles a physicalvolume of pvbns to create the aggregate 900, with pvbns 1 and 2comprising a volinfo block 902 for the aggregate. The volinfo block 902contains block pointers to fsinfo blocks 904, each of which mayrepresent a snapshot of the aggregate. Each fsinfo block 904 includes ablock pointer to an inode file 906 that contains inodes of a pluralityof files, including an owner map 800, an active map 912, a summary map914 and a space map 916, as well as other special metadata files. Theinode file 906 further includes a root directory 920 and a “hidden”metadata root directory 930, the latter of which includes a namespacehaving files related to a vvol in which users cannot “see” the files.The hidden metadata root directory also includes the WAFL/fsid/directory structure, as previously described, which contains afilesystem file 940 and storage label file 990. Note that root directory920 in the aggregate is empty; all files related to the aggregate areorganized within the hidden metadata root directory 930. This isdifferent from a conventional logical volume where the locations of allfiles in the volume are organized under the root directory.

In addition to being embodied as a container file having level 1 blocksorganized as a container map, the filesystem file 940 includes blockpointers that reference various file systems embodied as vvols 950. Theaggregate 900 maintains these vvols 950 at special reserved inodenumbers. Each vvol 950 also has special reserved inode numbers withinits vvol space that are used for, among other things, the blockallocation bitmap structures. As noted, the block allocation bitmapstructures, e.g., active map 962, summary map 964 and space map 966, arelocated in each vvol.

Specifically, each vvol 950 has the same inode file structure/content asthe aggregate, with the exception that there is no owner map and noWAFL/fsid/filesystem file, storage label file directory structure in ahidden metadata root directory 980. To that end, each vvol 950 has avolinfo block 952 that points to one or more fsinfo blocks 954, each ofwhich may represent a snapshot of the vvol. Each fsinfo block, in turn,points to an inode file 960 that, as noted, has the same inodestructure/content as the aggregate with the exceptions noted above.Notably, each vvol 950 has its own inode file 960 and distinct inodespace with corresponding inode numbers, as well as its own root (fsid)directory 970 and subdirectories of files that can be exportedseparately from other vvols.

The storage label file 990 contained within the hidden metadata rootdirectory 930 of the aggregate is a small file that functions as ananalog to a conventional raid label. A raid label includes “physical”information about the storage system, such as the volume name; thatinformation is loaded into the storage label file 990. Illustratively,the storage label file 990 includes the name 992 of the associated vvol950, the online/offline status 994 of the vvol, and other identity andstate information 996 of the associated vvol (whether it is in theprocess of being created or destroyed).

Management of the aggregate 900 is simplified through the use of the UI275 of the storage operating system 200 and a novel aggregate (“aggr”)and vvol (“vol”) command set available to a user/system administrator.The UI 275 illustratively implements the vol command to create a vvoland perform other logical-related functions/actions in the storagesystem 100. For instance, a resize option of the vol command set mayused to exploit a property of the extended file system layout thatenables “growing” of a vvol (file) using available disk space in theaggregate. Growing of a vvol only uses a small amount of additionalmetadata in the aggregate that essentially involves increasing thenumber of blocks that the vvol is allowed to use if necessary, alongwith increasing any volume level space guarantee or reservation. Inaddition, the resize command option may be used to reduce the size of avvol and return any free blocks to the aggregate. In general, freeblocks are rapidly returned to the aggregate; accordingly, sizereduction does not generally return free blocks, but rather reduces thenumber of blocks that the vvol is allowed to use and, in the presence ofa reservation, reduces the reservation charged to the aggregate for thevvol. Thus, the container file of the vvol remains the same size butuses fewer blocks.

Furthermore, the aggr command is implemented to perform physical(RAID)-related functions/actions, such as adding disks to an aggregate,mirroring an aggregate and mounting an aggregate. For example, anaggregate may be mounted in response to a mount command. When mountingthe aggregate, all contained vvols that are online are also mounted.Likewise, unmounting of an aggregate unmounts all vvols, automatically.Options to the mount command are provided to mount an aggregate andunmount the contained vvols. This is useful for maintenance purposes.

In response to the mount aggregate command, the storage operatingsystem, e.g., the file system 280, scans for vvols 950 and reads theirstorage label files 990, which provide information on all names andfsids for the vvols. This obviates collisions with offline vvols for newcreate commands and allow presentation of these vvols to the user for,e.g., mounting and destroying operations. The aggregate 900 maintains alist of raid-type information for all vvols and a list of all containedvvols that are mounted. A mounted vvol has access to its own raidinformation and has a pointer to the aggregate in which it resides. Whenloading the vvol, the storage operating system 200 accesses thefilesystem file 940 (container file) within the illustrative hiddenmetadata root directory 930 to select the fsid of that vvol. The storageoperating system then loads blocks 1 and 2 of the waft/container file940, which blocks comprise the volinfo block 952 for the vvol. Thevolinfo block is loaded in memory (in core) and includes block pointersto all other files within the vvol, including the block allocation mapfiles.

Advantageously, the extended file system layout assembles a group ofdisks into an aggregate having a large, underlying storage space andflexibly allocates that space among the vvols. To that extent, the vvolshave behaviors that are similar to those of qtrees, including access toall free block space within the aggregate without space boundarylimitations. Sizing of a vvol is flexible, avoiding partitioning ofstorage space and any resulting problems. The present invention providessubstantial performance advantages of a naïve nested volumesimplementation, particularly as optimized for low-latency readperformance, while allowing optimizations for background writingoperations.

Specifically, the aggregate provides a global storage space thatsubstantially simplifies storage management of the free block spacethrough the use of a single pool of storage (disk) resources. Since allvvols share the disks, a “hot” vvol, i.e., a vvol that is more heavilyutilized than other vvols, can benefit from all of the disks. Whenchanges occur within a vvol, all free space of the aggregate isavailable to make write allocation more efficient. For example, whenwrite allocating file data in a vvol, a write allocator 282 of the filesystem 280 selects free blocks for files of the vvol, with thoseselected blocks conveniently located anywhere within the aggregate.Moreover, because a vvol is a logical volume in a file, dirty blocksthat are freed within the vvol by the write allocator 282 during writeallocation may be returned to the aggregate, where they can be used byother vvols.

While there has been shown and described illustrative embodiments of anovel file system layout that apportions an underlying physical volumeinto a plurality of vvols of a storage system, it is to be understoodthat various other adaptations and modifications may be made within thespirit and scope of the invention. For example, rather than insertingonly pvbn block pointers in indirect (e.g., level 1) blocks in a buffertree of a file, the present invention contemplates alternativelyinserting pvbn, vvbn pairs in those indirect blocks in accordance with a“dual-vbn” embodiment. For such a dual-vbn embodiment, the number ofblock pointer entries per indirect block is 510 (rather than 1024),resulting in changes to the sizes of files at given levels (e.g., the 64kB-64MB range changes to 32 kB-16320 kB).

The use of pvbns as block pointers in the indirect blocks providesgenerally all of the advantages of having pvbns instead of vvbns suchas, e.g., efficiencies in the read paths when accessing data, while theuse of vvbn block pointers provides efficient access to requiredmetadata, such as per-volume block allocation information. That is, whenfreeing a block of a file, the parent indirect block in the filecontains readily available vvbn block pointers, which avoids the latencyassociated with accessing the owner map to perform pvbn-to-vvbntranslations; accordingly, the owner map is not needed in the dual vbnembodiment. Yet, on the read path, the pvbn is available. A disadvantageof this dual vbn variant is the increased size of indirection data(metadata) stored in each file.

The foregoing description has been directed to specific embodiments ofthis invention. It will be apparent, however, that other variations andmodifications may be made to the described embodiments, with theattainment of some or all of their advantages. For instance, it isexpressly contemplated that the teachings of this invention can beimplemented as software, including a computer-readable medium havingprogram instructions executing on a computer, hardware, firmware, or acombination thereof. Accordingly this description is to be taken only byway of example and not to otherwise limit the scope of the invention.Therefore, it is the object of the appended claims to cover all suchvariations and modifications as come within the true spirit and scope ofthe invention.

1. A data storage system, comprising: a processor configured to executea storage operating system, the storage operating system, when executed,configured to implement a physical volume comprised of a plurality ofdata storage devices, wherein the physical volume has a physical addressspace; and a plurality of logical volumes overlaid onto the physicalvolume, each of the logical volumes comprising a separate logical volumeaddress space; each block within a particular logical volume identifiedwith a logical volume address associated with one of the separatelogical volume address spaces; and for each of the plurality of logicalvolumes, a logical volume data container is stored in the physicalvolume, each logical volume data container storing all physical blocksassociated with a particular logical volume.
 2. The data storage systemof claim 1 wherein a pointer to a particular block within a datacontainer stored in a particular one of the plurality of logical volumescomprises a physical address of the particular block within the physicaladdress space and the logical volume address associated with theparticular block within the logical volume address space associated withthe logical volume storing the data container.
 3. A method for operatinga data storage system having a processor, comprising: organizing aphysical volume comprising a plurality of storage blocks on a pluralityof data storage devices, the plurality of storage blocks forming aphysical address space; storing a plurality of data containers withinthe physical volume, each of the data containers embodying a logicalvolume overlaid onto the physical volume, each of the logical volumeshaving a logical address space; storing a first mapping data structurethat provides a mapping between a physical address of the physicaladdress space and a logical address in the logical address space of aparticular logical volume; and storing a second mapping structure thatprovides a mapping between the logical address in the logical addressspace of the particular logical volume and the physical address of thephysical address space of the physical volume.
 4. The method of claim 3further comprising: implementing a file system on one of the logicalvolumes overlaid onto the physical volume; and storing a file having abuffer tree on the file system, wherein the buffer tree utilizes thephysical address as a block pointer.
 5. A computer readable storagemedium containing executable program instructions for execution by aprocessor comprising: program instructions that organize a set ofphysical addresses into a physical address space of a physical volume,each of the physical addresses being associated with a particular blockon one or more data storage devices organized to provide the physicaladdress space; program instructions that overlay a first logical volumeonto the physical volume, wherein the first logical volume has a firstlogical volume address space and wherein the physical volume stores afirst data container that stores each block associated with the firstlogical volume; program instructions that overlay a second logicalvolume onto the physical volume, wherein the second logical volume has asecond logical address space and wherein the physical volume stored asecond data container that stores each block associated with the secondlogical volume; and is program instructions that increase a size of thefirst logical volume, wherein free blocks within the physical volume areutilized to increase the size of the first logical volume.
 6. The datastorage system of claim 1 wherein the plurality of data storage devicesare organized into one or more RAID groups.
 7. The data storage systemof claim 1 wherein each of the logical volumes comprises a set of blockallocation structures stored within the logical volume address space ofthe particular logical volume.
 8. The data storage system of claim 7wherein the block allocation structures comprise an active map, a spacemap and a summary map.
 9. The data storage system of claim 1 whereineach logical volume address space comprises an independent set ofnumbers that are translated to disk block numbers (dbns) on a storagedevice of the plurality of storage devices.
 10. The data storage systemof claim 1 wherein at least one data object is stored in one of theplurality of logical volumes.
 11. The data storage system of claim 10wherein the data object is selected from a group consisting of a lun, adirectory, a qtree and a file.
 12. The data storage system of claim 1wherein at least one of the plurality of storage devices comprises anelectronic random access memory.
 13. The data storage system of claim 1wherein at least one of the plurality of storage devices comprises amicro-electro mechanical device.
 14. The data storage system of claim 2wherein each data container stored within one of the logical volumes isidentified by a physical address, a logical address and an identifier ofa logical volume.
 15. The method of claim 3 further comprisingconfiguring the plurality of data storage devices into one or more RAIDgroups.
 16. The method of claim 3 further comprising generating asnapshot of one of the plurality of logical volumes.
 17. The method ofclaim 3 further comprising: implementing a file system on one of thelogical volumes overlaid onto the physical volume; and storing a filehaving a buffer tree on the file system, wherein the buffer treeutilizes the logical address as a block pointer.
 18. The method of claim3 further comprising: implementing a file system on one of the logicalvolumes overlaid onto the physical volume; and storing a file having abuffer tree on the file system, wherein the buffer tree utilizes thephysical address and the logical address in a block pointer.
 19. Themethod of claim 3 further comprising increasing a size of a firstlogical volume of the plurality of logical volumes, wherein free blockswithin the physical volume are utilized to increase the size of thefirst logical volume.
 20. The method of claim 4 further comprisingtaking a snapshot of the file system implemented on one of the logicalvolumes.